[J,K]-Set Domination of Path Graphs
نویسندگان
چکیده
منابع مشابه
Domination Alteration Set!3 in Graphs
The domination number a(G) of a graph G is the size of a minimum dominating set, i.e., a set of points with the property that every other point is adjacent to a point of the set. In general a(G) can be made to increase or decrease by the removal of points from G. Our main objective is the study of this phenomenon. For example we show that if T is a tree with at least three points then a(T u) > ...
متن کاملDomination and Signed Domination Number of Cayley Graphs
In this paper, we investigate domination number as well as signed domination numbers of Cay(G : S) for all cyclic group G of order n, where n in {p^m; pq} and S = { a^i : i in B(1; n)}. We also introduce some families of connected regular graphs gamma such that gamma_S(Gamma) in {2,3,4,5 }.
متن کاملOn the super domination number of graphs
The open neighborhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $Dsubseteq V(G)$, we define $overline{D}=V(G)setminus D$. A set $Dsubseteq V(G)$ is called a super dominating set of $G$ if for every vertex $uin overline{D}$, there exists $vin D$ such that $N(v)cap overline{D}={u}$. The super domination number of $G$ is the minimum car...
متن کاملA Study on Point Set Domination of Intuitionistic Fuzzy Graphs
Let G = (V,E) be the IFG and D be set of vertices, then D is said to be Intuitionistic point set dominating set of G if for every S⊆ VD there exists a node d ∈ D such that the Intuitionistic fuzzy sub graph < S∪{d} > induced by S∪{d} is a connected Intuitionistic fuzzy graph. In this paper we study some results on Intuitionistic Point set dominating set and its number of IFGs. Also we establish...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal for Research in Applied Science and Engineering Technology
سال: 2019
ISSN: 2321-9653
DOI: 10.22214/ijraset.2019.4184